Paths algebra, similarities and system decomposition

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decomposition of Graphs into Paths

A decomposition of a graph G is a set D = {H1, · · · , Hk} of pairwise edge-disjoint subgraphs of G that cover the set of edges of G. If Hi is isomorphic to a fixed graph H, for 1 ≤ i ≤ k, then we say that D is an H-decomposition of G. In this work, we study the case where H is a path of fixed length. For that, we first decompose the given graph into trails, and then we use a disentangling lemm...

متن کامل

Decomposition of Trees and Paths via Correlation

We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for the special case of the tree being a star, we show that the problem is np-hard. For the special case of the tree being a path, this problem is known to be pol...

متن کامل

Relational Algebra for Ranked Tables with Similarities: Properties and Implementation

The paper presents new developments in an extension of Codd’s relational model of data. The extension consists in equipping domains of attribute values with a similarity relation and adding ranks to rows of a database table. This way, the concept of a table over domains (i.e., relation over a relation scheme) of the classical Codd’s model extends to the concept of a ranked table over domains wi...

متن کامل

Retracing Some Paths in Process Algebra

The very existence of the concur conference bears witness to the fact that “concurrency theory” has developed into a subject unto itself, with substantially different emphases and techniques to those prominent elsewhere in the semantics of computation. Whatever the past merits of this separate development, it seems timely to look for some convergence and unification. In addressing these issues,...

متن کامل

Triangular Decomposition of the Composition Algebra of the Kronecker Algebra

Let A be a nite dimensional hereditary algebra over a nite eld, H(A) and C(A) be respectively the Ringel-Hall algebra and the composition algebra of A. Deene r d to be the element P M] 2 H(A), where M] runs over the isomorphism classes of the regular A?modules with dimension vector d. We prove that r d and the exceptional A?modules all lie in C(A). Let K be the Kronecker algebra, P (resp. I) th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1984

ISSN: 0022-247X

DOI: 10.1016/0022-247x(84)90203-8